A cycle index sum inversion theorem
نویسندگان
چکیده
منابع مشابه
Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs
Algebraic inversion of cycle index sum relations is employed to derive new algorithms for counting unlabeled graphs which are (a) 2-connected, (b) 2-connected and homeomorphically irreducible, and (c) 3-connected. The new algorithms are signiicantly more eecient than earlier ones, both asymptotically and for modest values of the order. Time-and space-complexity analyses of the algorithms are pr...
متن کاملA 'sum of Squares' Theorem for Visibility Complexes a 'sum of Squares' Theorem for Visibility Complexes
We present a new and simpler method to implement in constant amortized time the ip operation of the so-called 'Greedy Flip Algorithm', an optimal algorithm to compute the visibility graph/complex of a collection of pairwise disjoint bounded convex sets of constant complexity. The method uses only the incidence structure of the visibility complex and only the primitive predicate which states tha...
متن کاملA Digital Index Theorem
This paper is devoted to prove a Digital Index Theorem for digital (n − 1)-manifolds in a digital space (Rn, f), where f belongs to a large family of lighting functions on the standard cubical decomposition Rn of the n-dimensional Euclidean space. As an immediate consequence we obtain the corresponding theorems for all (α, β)-surfaces of Kong-Roscoe, with α, β ∈ {6, 18, 26} and (α, β) 6= (6, 6)...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملA Binomial Sum Related to Wolstenholme’s Theorem
A certain alternating sum u(n) of n + 1 products of two binomial coefficients has a property similar to Wolstenholme’s theorem, namely u(p) ≡ −1 (mod p3) for all primes p ≥ 5. However, this congruence also holds for certain composite integers p which appear to always have exactly two prime divisors, one of which is always 2 or 5. This phenomenon will be partly explained and the composites in qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1981
ISSN: 0097-3165
DOI: 10.1016/0097-3165(81)90021-2